//
// Created by yangchao on 2022/6/3.
// 118. 杨辉三角: https://leetcode.cn/problems/pascals-triangle/
//
#include <vector>
using namespace std;

class Generate {
public:
    vector<vector<int>> generate(int numRows) {
        vector<vector<int>> res(numRows);
        for (int i = 0; i < numRows; ++i) {
            res[i].resize(i+1);
            res[i][0] = res[i][i] = 1;
            for (int j = 1; j < i; ++j) {
                res[i][j] = res[i-1][j] + res[i-1][j-1];
            }
        }
        return res;
    }
};

